Some further clarification on Markov chain random fields and transiograms
نویسندگان
چکیده
The Markov chain random field (MCRF) theory and the transiogram spatial measure were proposed several years ago. Basic sequential simulation algorithms based on simple MCRF models such as the Markov chain sequential simulation algorithm and the Markov chain sequential co-simulation algorithm have been developed and used in a series of application studies. However, misunderstanding of these two ideas and the geostatistical approach built on them arose recently among some researchers in geostatistics. The purpose of this article is to further clarify some issues related to these two ideas, so as to avoid further misunderstanding. For those issues already clarified, trivial, or obviously irrelevant, we do not talk about them here.
منابع مشابه
A Generalized Markov Chain Approach for Conditional Simulation of Categorical Variables from Grid Samples
Complex categorical variables are usually classified into many classes with interclass dependencies, which conventional geostatistical methods have difficulties to incorporate. A two-dimensional Markov chain approach has emerged recently for conditional simulation of categorical variables on line data, with the advantage of incorporating interclass dependencies. This paper extends the approach ...
متن کاملRecursive computing for Markov random fields
We present a recursive algorithm to compute a collection of normalising constants which can be used in a straightforward manner to sample a realisation from a Markov random field. Further we present important consequences of this result which renders possible tasks such as maximising Markov random fields, computing marginal distributions, exact inference for certain loss functions and computing...
متن کاملModeling experimental cross-transiograms of neighboring landscape categories with the gamma distribution
Effectively fitting the major features of experimental transiograms (or variograms) is crucial in characterizing spatial patterns and reproducing them in geostatistical simulations. Landscape patterns usually tend to contain neighboring structures. The experimental cross-transiograms of frequent neighboring landscape categories normally demonstrate apparent peaking features at low lag distances...
متن کاملADK Entropy and ADK Entropy Rate in Irreducible- Aperiodic Markov Chain and Gaussian Processes
In this paper, the two parameter ADK entropy, as a generalized of Re'nyi entropy, is considered and some properties of it, are investigated. We will see that the ADK entropy for continuous random variables is invariant under a location and is not invariant under a scale transformation of the random variable. Furthermore, the joint ADK entropy, conditional ADK entropy, and chain rule of this ent...
متن کاملApproximate Bayes Model Selection Procedures for Markov Random Fields
For applications in texture synthesis, we derive two approximate Bayes criteria for selecting a model from a collection of Markov random fields. The first criterion is based on a penalized maximum likelihood. The second criterion, a Markov chain Monte Carlo approximation to the first, has distinct computational advantages. Some simulation results are also presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- International Journal of Geographical Information Science
دوره 27 شماره
صفحات -
تاریخ انتشار 2013